Approximate nonparametric maximum likelihood for mixture models: A convex optimization approach to fitting arbitrary multivariate mixing distributions

نویسندگان

  • Long Feng
  • Lee H. Dicker
چکیده

Nonparametric maximum likelihood (NPML) for mixture models is a technique for estimating mixing distributions, which has a long and rich history in statistics going back to the 1950s (Kiefer and Wolfowitz, 1956; Robbins, 1950). However, NPMLbased methods have been considered to be relatively impractical because of computational and theoretical obstacles. Recent work focusing on approximate NPML methods and leveraging modern computing power suggests, on the other hand, that these methods may have great promise for many interesting applications. Most of this recent work has focused on specific examples involving relatively simple statistical models and univariate mixing distributions. In this paper, we propose a general approach to fitting arbitrary multivariate mixing distributions with NPML-based methods via convex optimization. The proposed methods are highly flexible and easy to implement. We illustrate their performance in several applications involving estimation and classification.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Frailty, Profile Likelihood and (Medfly) Mortality

Unobserved heterogeneity is an increasingly common feature of statistical survival analysis where it is often referred to as frailty. Parametric mixture models are frequently used to capture these effects, but it is sometimes desirable to consider nonparametric mixture models as well. We illustrate the latter approach with a reanalysis of the well-known large scale medfly mortality study of Car...

متن کامل

Convex Clustering with Exemplar-Based Models

Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization problem is inherently a gradient-descent method and is sensitive to initialization. The resulting solution is a local optimum in the neighborhood of the initial guess. This sensitivity to initialization presents a signifi...

متن کامل

Convex Clustering with Exemplar-Based Models

Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization problem is inherently a gradient-descent method and is sensitive to initialization. The resulting solution is a local optimum in the neighborhood of the initial guess. This sensitivity to initialization presents a signifi...

متن کامل

Convex Clustering with Exemplar-Based Models

Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization problem is inherently a gradient-descent method and is sensitive to initialization. The resulting solution is a local optimum in the neighborhood of the initial guess. This sensitivity to initialization presents a signifi...

متن کامل

AN OPTIMUM APPROACH TOWARDS SEISMIC FRAGILITY FUNCTION OF STRUCTURES THROUGH METAHEURISTIC HARMONY SEARCH ALGORITHM

Vulnerability assessment of structures encounter many uncertainties like seismic excitations intensity and response of structures. The most common approach adopted to deal with these uncertainties is vulnerability assessment through fragility functions. Fragility functions exhibit the probability of exceeding a state namely performance-level as a function of seismic intensity. A common approach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 122  شماره 

صفحات  -

تاریخ انتشار 2018